VPG and EPG bend-numbers of Halin Graphs
نویسندگان
چکیده
A piecewise linear simple curve in the plane made up of k+1 line segments, each of which is either horizontal or vertical, with consecutive segments being of different orientation is called a k-bend path. Given a graph G, a collection of k-bend paths in which each path corresponds to a vertex in G and two paths have a common point if and only if the vertices corresponding to them are adjacent in G is called a Bk-VPG representation of G. Similarly, a collection of k-bend paths each of which corresponds to a vertex in G is called an Bk-EPG representation of G if any two paths have a line segment of non-zero length in common if and only if their corresponding vertices are adjacent in G. The VPG bend-number bv(G) of a graph G is the minimum k such that G has a Bk-VPG representation. Similarly, the EPG bend-number be(G) of a graph G is the minimum k such that G has a Bk-EPG representation. Halin graphs are the graphs formed by taking a tree with no degree 2 vertex and then connecting its leaves to form a cycle in such a way that the graph has a planar embedding. We prove that if G is a Halin graph then bv(G) ≤ 1 and be(G) ≤ 2. These bounds are tight. In fact, we prove the stronger result that if G is a planar graph formed by connecting the leaves of any tree to form a simple cycle, then it has a VPG-representation using only one type of 1-bend paths and an EPG-representation using only one type of 2-bend paths.
منابع مشابه
Approximation Algorithms for Independence and Domination on B1-VPG and B1-EPG Graphs
A graph G is called Bk-VPG (resp., Bk-EPG), for some constant k ≥ 0, if it has a string representation on a grid such that each vertex is an orthogonal path with at most k bends and two vertices are adjacent in G if and only if the corresponding strings intersect (resp., the corresponding strings share at least one grid edge). If two adjacent strings of a Bk-VPG graph intersect exactly once, th...
متن کاملBend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill
In this paper we study properties of intersection graphs of kbend paths in the rectangular grid. A k-bend path is a path with at most k 90 degree turns. The class of graphs representable by intersections of k-bend paths is denoted by Bk-VPG. We show here that for every fixed k, Bk-VPG ( Bk+1-VPG and that recognition of graphs from Bk-VPG is NP-complete even when the input graph is given by a Bk...
متن کاملEdge intersection graphs of single bend paths on a grid
We combine the known notion of the edge intersection graphs of paths in a tree with a VLSI grid layout model to introduce the edge intersection graphs of paths on a grid. Let P be a collection of nontrivial simple paths on a grid G. We define the edge intersection graph EPG(P) of P to have vertices which correspond to the members of P, such that two vertices are adjacent in EPG(P) if the corres...
متن کاملIntersection Graphs of L-Shapes and Segments in the Plane
An L-shape is the union of a horizontal and a vertical segment with a common endpoint. These come in four rotations: L, L , Land L . A k-bend path is a simple path in the plane, whose direction changes k times from horizontal to vertical. If a graph admits an intersection representation in which every vertex is represented by an L, an L or L , a k-bend path, or a segment, then this graph is cal...
متن کاملRecognizing Some Subclasses of Vertex Intersection Graphs of 0-Bend Paths in a Grid
We investigate graphs that can be represented as vertex intersections of horizontal and vertical paths in a grid, known as B0-VPG graphs. Recognizing these graphs is an NP-hard problem. In light of this, we focus on their subclasses. In the paper, we describe polynomial time algorithms for recognizing chordal B0-VPG graphs, and for recognizing B0-VPG graphs that have a representation on a grid ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 215 شماره
صفحات -
تاریخ انتشار 2016